On trees with a maximum proper partial 0–1 coloring containing a maximum matching
نویسندگان
چکیده
منابع مشابه
On trees with a maximum proper partial 0-1 coloring containing a maximum matching
I prove that in a tree in which the distance between any two endpoints is even, there is a maximum proper partial 0 − 1 coloring such that the edges colored by 0 form a maximum matching.
متن کاملHarmonious coloring of trees with large maximum degree
A harmonious coloring of G is a proper vertex coloring of G such that every pair of colors appears on at most one pair of adjacent vertices. The harmonious chromatic number of G, h(G), is the minimum number of colors needed for a harmonious coloring of G. We show that if T is a forest of order n with maximum degree ∆(T ) ≥ n+2 3 , then h(T ) = { ∆(T ) + 2, if T has non-adjacent vertices of degr...
متن کاملOn the Maximum Number of Dominating Classes in Graph Coloring
In this paper we investigate the dominating- -color number، of a graph G. That is the maximum number of color classes that are also dominating when G is colored using colors. We show that where is the join of G and H. This result allows us to construct classes of graphs such that and thus provide some information regarding two questions raised in [1] and [2].
متن کاملA Self-Stabilizing Algorithm for Maximum Matching in Trees
Constructing a maximum matching is an important problem in graph theory with applications to problems such as job assignment and task scheduling. Many eecient sequential and parallel algorithms exist for solving the problem. However, no distributed algorithms are known. In this paper, we present a distributed, self-stabilizing algorithm for nding a maximum matching in trees. Since our algorithm...
متن کاملOn Maximum Differential Graph Coloring
Abstract. We study the maximum differential graph coloring problem, in which the goal is to find a vertex labeling for a given undirected graph that maximizes the label difference along the edges. This problem has its origin in map coloring, where not all countries are necessarily contiguous. We define the differential chromatic number and establish the equivalence of the maximum differential c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2006
ISSN: 0012-365X
DOI: 10.1016/j.disc.2005.12.019